316 theory morphology Flashcards

(10 cards)

1
Q

productive morpheme

A

a morpheme is productive when there a multiple instances of an instance of a word.. create..creating..created

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

morphology

A

the study of how words are composed using morphemes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

morphological parsing

A

taking the surface input and breaking it down into morphemes,identifying its components and underlying structure.. the act of taking foxes and its fox- noun and es-plural suffix

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Inflection, derivation, compounding,cliticization

A

changind of words which results in the:
1. same class
2.different class
combining stems to make a new word
apostrophe words

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

why do we parse

A

for spell checking
to identify the stem for information retrieval
to identify parts of speech for machine translation and sentence parsing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what do we need to build a morphological parser

A

lexicon- stems and affices
morphotactics- model of how morphemes can be affixed to the stem
orthographic rules: spelling modifications when the affixtion occurs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

lexicon

A

a repository of words

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

limitations of using FSA’s

A

-non determinism
-its too large ..adding new items will need to recompute the whole FSA so in this case its too complication and innefficient
-its limited..can only tell us what word is in the language or not

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

if a and b are independant..what is p(a/b)
what is the formula for P(a/b)
mutuall exclusive and exhaustive

A
  • P(a)
  • P(A n B)/P(B)
    *ai n aj= empty set
  • all mutually exclusive items make up the whole sample space
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

alternative P(A/B)

A

*P(A N B)/P(B)
* P(B/A).P(A)/sum(P(B/Ai).P(Ai))
* sum = the Ai and the Ai’(not)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly