Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Morfologisk analys× | TF-IDF× | |
|---|---|---|
| Ämnesområde | Textutvinning | Textutvinning |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1980 | 1988 |
| Upphovsperson≠ | M.F. Porter (Porter stemmer) | Salton & Buckley |
| Typ≠ | Text-normalisation preprocessing task | Text vectorization / term-weighting scheme |
| Ursprungskälla≠ | Porter, M.F. (1980). An Algorithm for Suffix Stripping. Program, 14(3), 130-137. DOI ↗ | Salton, G. & Buckley, C. (1988). Term-weighting approaches in automatic text retrieval. Information Processing & Management, 24(5), 513-523. DOI ↗ |
| Alias | stemming, lemmatization, Morfolojik Analiz ve Kök Bulma | term weighting, tf-idf weighting, TF-IDF Vektörizasyonu |
| Närliggande≠ | 4 | 3 |
| Sammanfattning≠ | Morphological analysis splits words into their stems and affixes so that different surface forms of the same word can be treated as one. It covers two complementary approaches — rule-based stemming, such as the Porter (1980) and Snowball algorithms, and dictionary-aware lemmatization — and is a critical text-normalisation step for agglutinative languages such as Turkish and Arabic. | TF-IDF, introduced by Salton and Buckley (1988), is a term-weighting scheme that scores each word in a document by how often it appears there and how rare it is across the whole collection. It turns raw text into weighted document vectors, giving high weight to terms that are frequent in one document but uncommon elsewhere. |
| ScholarGateDatamängd ↗ |
|
|