130 likes | 317 Views
Pertemuan 23 Syntatic Processing. Matakuliah : T0264/Intelijensia Semu Tahun : 2005 Versi : 1/0. Learning Outcomes. Pada akhir pertemuan ini, diharapkan mahasiswa akan mampu : << TIK-99 >> << TIK-99>>. Outline Materi. Materi 1 Materi 2 Materi 3 Materi 4 Materi 5. Roles.
E N D
Pertemuan 23Syntatic Processing Matakuliah : T0264/Intelijensia Semu Tahun : 2005 Versi : 1/0
Learning Outcomes Pada akhir pertemuan ini, diharapkan mahasiswa akan mampu : • << TIK-99 >> • << TIK-99>>
Outline Materi • Materi 1 • Materi 2 • Materi 3 • Materi 4 • Materi 5
Roles • Constraint the number of consti-tuents that semantic can consider. Since syntax is cheaper then semantics, this is cost effective. • Force syntactically required interpretations, for example in distinguishing the meanings of: • The satellite orbited Mars. • Mars orbited the satellite.
Components • Grammar • Parser
A Simple Grammar for a Fragment of English S NP VP NP the NP1 NP PRO NP PN NP NP1 NP1 ADJS N ADJS ADJ ADJS VP V VP V NP N file NP printer PN Bill PRO I ADJ short long fast V printed created want
Ambiguity Examples : “Have the students who missed the exam take it today.” ” Have the students who missed the exam taken it today ?” “ The horse raced past the barn fell down.”
Parsing Strategies • Top-Down • Bottom-Up • All Paths • Best Path with Backtracking • Best Path with Patchup • Wait and See
Unification Grammars • Purely declarative representations • Unification simultaneously performs two operations: • Matching • Structure building, by combining constituents • Think of graphs as sets not lists, i.e., order doesn’t matter.
[CAT: DET LEX: the ] [CAT: N LEX: file NUMBER: SING] Unification Grammars contd’ • Lexical items as graphs: • Nonterminal constituents as graphs: [NP: [DET: the HEAD: file NUMBER: SING]
[CONSTITUENT1: [CAT: DET LEX: {1}] [CONSTITUENT2: [CAT: N LEX: {2} NUMBER {3}] [BUILD: [NP: [DET: {1} HEAD: {2} NUMBER {3}]]] Unification Grammars contd’ • Grammar rules (e.g., NP DET N) as graphs: