Hausser, R.: Grammatical disambiguation : the linear complexity hypothesis for natural language (2020)
0.00
0.002579418 = product of:
0.005158836 = sum of:
0.005158836 = product of:
0.010317672 = sum of:
0.010317672 = weight(_text_:a in 22) [ClassicSimilarity], result of:
0.010317672 = score(doc=22,freq=16.0), product of:
0.04772363 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.041389145 = queryNorm
0.2161963 = fieldWeight in 22, product of:
4.0 = tf(freq=16.0), with freq of:
16.0 = termFreq=16.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=22)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- DBS uses a strictly time-linear derivation order. Therefore the basic computational complexity degree of DBS is linear time. The only way to increase DBS complexity above linear is repeating ambiguity. In natural language, however, repeating ambiguity is prevented by grammatical disambiguation. A classic example of a grammatical ambiguity is the 'garden path' sentence The horse raced by the barn fell. The continuation horse+raced introduces an ambiguity between horse which raced and horse which was raced, leading to two parallel derivation strands up to The horse raced by the barn. Depending on whether the continuation is interpunctuation or a verb, they are grammatically disambiguated, resulting in unambiguous output. A repeated ambiguity occurs in The man who loves the woman who feeds Lucy who Peter loves., with who serving as subject or as object. These readings are grammatically disambiguated by continuing after who with a verb or a noun.
- Type
- a
