; A simple, but invalid sentence: A man saw something (some thing)
; (Doesn't try the graph parse, since the sentence fails before splitting)

	[
((name something) (pos n) (tokens (*MULT* 4 5))),
((name A) (pos det) (tokens 1)),
((name man) (pos foo) (tokens 2)),
((name saw) (pos v) (tokens 3)),
((name some) (pos det) (tokens 4)),
((name thing) (pos n) (tokens 5))
	]


; A simple, but nonlinear sentence: A man saw something (some thing)
; (Doesn't try the graph parse, because linear parse succeeds)

	[
((name something) (pos n) (tokens (*MULT* 4 5))),
((name A) (pos det) (tokens 1)),
((name man) (pos n) (tokens 2)),
((name saw) (pos v) (tokens 3)),
((name some) (pos det) (tokens 4)),
((name thing) (pos n) (tokens 5))
	]


; A hard, but linear sentence: Jack sees a man in the park with a telescope

	[
((root Jack) (pos n) (tokens 1)),
((root sees) (pos v) (tokens 2)),
((root a) (pos det) (tokens 3)),
((root man) (pos n) (tokens 4)),
((root in) (pos prep) (tokens 5)),
((root the) (pos det) (tokens 6)),
((root park) (pos n) (tokens 7)),
((root with) (pos prep) (tokens 8)),
((root a) (pos det) (tokens 9)),
((root telescope) (pos n) (tokens 10))
	]


; A 1-parse sentence with a complex graph input structure
; the fuel injection nozzle holes zerk grease fittings
; (SUBJ 'f.i.n' V holes OBJ 'z.g.f')
; The linear parse fails, so the graph parse must be tried.

	[
((root the) (pos det) (tokens 1)),
((root fuel) (pos (*OR* v n)) (tokens 2)),
((root injection) (pos n) (tokens 3)),
((root fuel-injection) (pos n) (tokens (*MULT* 2 3))),
((root nozzle) (pos n) (tokens 4)),
((root fuel-injection-nozzle) (pos n) (tokens (*MULT* 2 3 4))),
((root hole) (pos v) (tokens 5)),
((root fuel-injection-nozzle-hole) (pos n) (tokens (*MULT* 2 3 4 5))),
((root nozzle-hole) (pos n) (tokens (*MULT* 4 5))),
((root zerk-grease-fittings) (pos n) (tokens (*MULT* 6 7 8))),
((root grease-fittings) (pos n) (tokens (*MULT* 7 8))),
((root grease) (pos n) (tokens 7)),
((rot fittings) (pos n) (tokens 8))
	]


; A simple, but invalid sentence: Someone (some one) saw the man
; (Does try the graph parse, because the failure occurs after the split

	[
((name Someone) (pos n) (tokens (*MULT* 1 2))),
((name Some) (pos det) (tokens 1)),
((name one) (pos n) (tokens 2)),
((name saw) (pos v) (tokens 3)),
((name a) (pos det) (tokens 4)),
((name man) (pos foo) (tokens 5))
	]


; A tricky sentence. Jack did see a man.
; The 'a-man' kills the linear parse. The graph parse shouldn't barf
; on 'did-see'.

	[
((name Jack) (pos n) (tokens 1)),
((name did) (pos v) (tokens 2)),
((name see) (pos v) (tokens 3)),
((name did-see) (pos v) (tokens (*MULT* 2 3))),
((name a) (pos det) (tokens 4)),
((name man) (pos n) (tokens 5)),
((name a-man) (pos foo) (tokens (*MULT* 4 5)))
	]


