Presentation is loading. Please wait.

Presentation is loading. Please wait.

November 2003CSA3050 Conflation Algorithms1 CSA305: NLP Algorithms Conflation Algorithms.

Similar presentations

Presentation on theme: "November 2003CSA3050 Conflation Algorithms1 CSA305: NLP Algorithms Conflation Algorithms."— Presentation transcript:

1 November 2003CSA3050 Conflation Algorithms1 CSA305: NLP Algorithms Conflation Algorithms

2 November 2003CSA3050 Conflation Algorithms2 Acknowledgements John Repici (2002) Ex1.htm Porter, M.F., 1980, An algorithm for suffix stripping, reprinted in Sparck Jones, Karen, and Peter Willet, 1997, Readings in Information Retrieval, San Francisco: Morgan Kaufmann, ISBN [Vince has a copy of this] Jurafsky & Martin appendix B pp

3 November 2003CSA3050 Conflation Algorithms3 Word Conflation Algorithms Morphological analysis versus conflation Notion of word class is application dependent –Geneology: Phonetic similarity –Information Retrieval: Semantic similarity Soundex Porter

4 November 2003CSA3050 Conflation Algorithms4 Problems with Names Names can be misspelt: Rossner Same name can be spelt in different ways Kirkop; Chircop Same name appears differently in different cultures: Tchaikovsky; Chaicowski To solve this problem, we need phonetically oriented algorithms which can find similar sounding terms and names. Just such a family of algorithms exist and are called SoundExes, after the first patented version.

5 November 2003CSA3050 Conflation Algorithms5 The Soundex Algorithm A Soundex algorithm takes a word as input and produces a character string which identifies a set of words that are (roughly) phonetically alike. It is very handy for searching large databases Originally developed by Margaret K. Odell and Robert C. Russell [cf. U.S. Patents (1918), (1922)], of the US Bureau of Archives, to simplify census-taking. Don Knuth's implementation in his book "The Art of Computer Programming, vol.3: Searching and Sorting," the algorithm enjoyed a new popularity.

6 November 2003CSA3050 Conflation Algorithms6 Soundex Algorithm 1 The Soundex Algorithm uses the following steps to encode a word: 1.The first character of the word is retained as the first character of the Soundex code. 2.The following letters are discarded: a,e,i,o,u,h,w, and y. 3.If consonants having the same code number appear consecutively, the number will only be coded once. (e.g. "B233" becomes "B23")

7 November 2003CSA3050 Conflation Algorithms7 Code Numbers b, p, f, and v1 c, s, k, g, j, q, x, z2 d, t3 l4 m,n5 r6

8 November 2003CSA3050 Conflation Algorithms8 Soundex Algorithm 2 –The resulting code is modified so that it becomes exactly four characters long: If it is less than 4 characters, zeroes are added to the end (e.g. "B2" becomes "B200") –If it is more than 4 characters, the code is truncated (e.g. "B2435" becomes "B243")

9 November 2003CSA3050 Conflation Algorithms9 Uses for the Soundex Code Airline reservations - The soundex code for a passenger's surname is often recorded to avoid confusion when trying to pronounce it. U.S. Census - As is noted above, the U.S. Census Department was a frequent user of the Soundex algorithm while trying to compile a listing of families around the turn of the century. Geneology - In geneology, the Soundex code is most often used to avoid obstacles when dealing with names that might have alternate spellings.

10 November 2003CSA3050 Conflation Algorithms10 Improvements Preprocessing before applying the basic algorithm, e.g. –DG with G –GH with H –GN with N (not 'ng') –KN with N –PH with F Question: where to stop?

11 November 2003CSA3050 Conflation Algorithms11 IR Applications Information Retrieval: Query → → Relevant Documents “Bag of Terms” document model What is a single term?

12 November 2003CSA3050 Conflation Algorithms12 Why Stemming is Necessary Frequently we get collections of words of the following kind in the same document compute, computer, computing, computation, computability …. Performance of IR system will be improved if all of these terms are conflated. –Less terms to worry about –More accurate statistics

13 November 2003CSA3050 Conflation Algorithms13 Issues Is a dictionary available? –Stems –Affixes Motivation: linguistic credibility or engineering performance? When to remove a affix versus when to leave it alone Porter (1980): W 1 and W 2 should be conflated if there appears to be no difference between the statements "this document is about W 1 /W 2 " relate/relativity vs. radioactive/radioactivity

14 November 2003CSA3050 Conflation Algorithms14 Consonants and Vowels A consonant is a letter other than a,e,i,o,u and other than y preceded by a consonant: sky, toy If a letter is not a consonant it is a vowel. A sequence of consonants (cc..c) or vowels (vv..v) will be represented by C or V respectively. For example the word troubles maps to C V C V C Any word or part of a word, therefore has one of the following forms: (CV) n ….C (CV) n ….V (VC) n ….C (VC) n ….V

15 November 2003CSA3050 Conflation Algorithms15 Measure All the above patterns can be replaced by the following regular expression (C) (VC) m (V) m is called the measure of any word or word part. m=0: tr, ee, tree, y, by m=1: trouble, oats, trees, ivy m=2: troubles; private

16 November 2003CSA3050 Conflation Algorithms16 Rules Rules for removing a suffix are given in the form (condition) S1 → S2 If a word ends ends with suffix S1, and the stem before S1 satisfies the condition, then it is replaced with S2. Example (m > 1) EMENT →

17 November 2003CSA3050 Conflation Algorithms17 Conditions *S - stem ends with s *Z - stem ends with z *T – stem ends with t *v* - stem contains a vowel *d - stem ends with a double consonant *o - stem ends cvc, where second c is not w, x or y e.g. –wil, -hop In conditions, Boolean operators are possible e.g. (m>1 and (*S or *T)) Sets of rules applied in 7 steps. Within each step, rule matching longest suffix applies.

18 November 2003CSA3050 Conflation Algorithms18 Organisation Step 1 Plurals and Third Person Singular Verbs Step 2 Verbal Past Tense and Progressive Step 3: Y to I Noun Inflections Steps 4 and 5 Derivational Morphology Multiple Suffixes visualisation → visualise Steps 6 Derivational Morphology Single Suffixes Step 7 Cleanup -s -ed, -ingfly/flies

19 November 2003CSA3050 Conflation Algorithms19 Step 1:Plural Nouns and 3 rd Person Singular Verbs conditionrewriteexample SSES → SScaresses → caress IES → Iponies → poni SS → SScaress → caress S →cats → cat

20 November 2003CSA3050 Conflation Algorithms20 Step 2a Verbal Past Tense and Progressive Forms conditionrewriteexample (m>0)EED → EEfeed → feed agreed → agree (*v*)ED → εplastered → plaster bled → bled (*v*)ING → εkilling → kill sing → sing

21 November 2003CSA3050 Conflation Algorithms21 Step 2b: Cleanup If 2 nd or 3 rd of last step succeeds conditionrewriteexample AT → ATEgenerat → generate BL → BLEtroubl → trouble IZ → IZEcapsiz → capsize *d and not (*L or *S or *Z) → single letter hopping → hop hissing → hiss

22 November 2003CSA3050 Conflation Algorithms22 Step 3: Y to I (*v*)Y → Ihappy → happi cry → cry

23 November 2003CSA3050 Conflation Algorithms23 STEP 4: Derivational Morphology 1 – Multiple Suffixes (excerpt) ConditionRewriteExample (m > 0)ATIONAL → ATErelational → relate (m > 0)TIONAL → TIONconditional → condition (m > 0)ENCI → ENCEvalenci → valence (m > 0)ABLI → ABLEcomfortabli → comfortable (m > 0)OUSLI → OUSanalagously → analagous (m > 0)IZATION → IZEdigitizer → digitize (m > 0)ATION → ATEgeneration → generate (m > 0)ATOR → ATEoperator → operate (m > 0)ALISM → ALformalism → formal (m > 0)IVENESS → IVEpensiveness → pensive (m > 0)FULNESS → FULhopefulness → hopeful (m > 0)OUSNESS → OUScallousness → callous (m > 0)ALITI → ALformality → formal (m > 0)BILITI → BLEpossibility → possible

24 November 2003CSA3050 Conflation Algorithms24 Step 6: Derivational Morphology III: Single Suffixes ConditionRewriteExample (m > 1)AL → εrevival → reviv (m > 1)ANCE → εallowance → allow (m > 1)ENCE → εinference → infer (m > 1)ER → εairliner → airlin (m > 1)IC → εCoptic → Copt (m > 1)ABLE → εlaughable → laugh (m > 1)ANT → εirritant → irrit (m > 1)EMENT → εreplacement → replac (m > 1)MENT → εadjustment → adjust (m > 1)ENT → εdependent → depend (m > 0) (*S or *T)ION → εadoption → adopt (m > 1)OU → εcallousness → callous (m > 1)ISM → εformalism→ formal (m > 1)ATE → εactivate → activ ITI → ε

25 November 2003CSA3050 Conflation Algorithms25 Porter Example INPUT in the first focus area, integrated projects shall help develop, principally, common open platforms for software and services supporting a distributed information and decision systems for risk and crisis management

26 November 2003CSA3050 Conflation Algorithms26 Porter Output Original WordStemmed Word first focusfocu area integratedintegr projectsproject help develop principallyprincip common open platformsplatform Original WordStemmed Word platformsplatform softwaresoftwar servicesservic supportingsupport distributeddistribut informationinform decisiondecis systemssystem risk crisiscrisi managementmanag

Download ppt "November 2003CSA3050 Conflation Algorithms1 CSA305: NLP Algorithms Conflation Algorithms."

Similar presentations

Ads by Google