60 likes | 199 Views
Introduction. Morphology is the study of the way words are built from smaller units : morphemes un- believe - able - ly Two broad classes of morphemes : stems ( main , meaning ) and affixes ( additional ). Affixes Prefixes : precide the stem : un- certain , un- chain
E N D
Introduction • Morphologyisthestudy of thewaywords are builtfromsmallerunits: morphemesun-believe-able-ly • Twobroadclasses of morphemes: stems (main, meaning) and affixes (additional). • Affixes • Prefixes:precidethestem: un-certain, un-chain • Sufixes:eat-s
Introduction Affixes • Prefixes:precidethestem: un-certain, un-chain • Sufixes:eat-s • Circumfixes: prefixes and sufixes: sagen – ge-sag-t • Infixes:Inserted in themiddle of theword: tagaloglanguage, not in formal English (but in dialects: bl**dy,f**king, abso-bl**dy-lutely).
Introduction • Agglutinativelanguagestendtostringaffixestogether - Turkish, 10 or more affixes - English no more than 5 • Differentwaysto combine morphemes: • Inflection: stem + grammaticalmorpheme sintacticfunction: plural and gender in nouns tense onverbs • Derivation:stem + grammaticalmorpheme differentclass, differentmeaning Computerize-computerization
Introduction • Differentwaysto combine morphemes: • Inflection: stem + grammaticalmorpheme (sintacticfunction: plural, gender, tense) • Derivation:stem + grammaticalmorpheme(differentclass, differentmeaning). Computerize-computerization • Compounding.Combination of multiplestems:doghouse • Cliticization: stem+ clitic (reduced in form): I’ve • Inflection in Englishis simple (-s,-ed,-ing) Derivationis more complex (suffixes –ation,-ness,-able, prefixesco-,re-)
Introduction • Morphologicalparsingistheprocess of findingtheconstituentmorphemes in a word cat +N+ plforcats • Tobuild a morphologicalparserweneed • A lexicon: thelist of stems and affixed and basicinformationaboutthem. • Morphotacticsisthemodel of morphemeorderingthatexplainstheallowablemorphemesequences. • Orthografics rules: spelling rules tomodelthechangeswhencombiningmorphemes: city- cities
Introduction • Manyconstraintsonmorphotactics can berepresentedbyfiniteautomata • Finitestatetransducers are anextension of finite-stateautomatathat can generate output symbols. • Finitestatetransducers are usedfor: morphologyrepresentation, parsing, spelling error detection: • Lexicon and spelling rules can berepresentedbycomposing and intersectingtransducers