Head-driven Phrase Structure Grammar I
Head-driven Phrase Structure Grammar I Head-driven Phrase Structure Grammar I
Basic Idea Typed feature structure HPSG: First glance TFS: Graphs or AVMs Graph noun 3rd predicate SUBJ AGR agreement P ERS P RED verb AGR NUM singular AVM ⎡ ⎡ [ ]⎤ ⎤ person 3rd subj ⎣agr 1 ⎦ num singular agreement ⎢ noun ⎣ ] ⎥ ⎦ pred [agr 1 verb Weiwei Sun Head-driven Phrase Structure Grammar I 25/61
Basic Idea Typed feature structure HPSG: First glance TFS: Formal definition Definition A typed feature structure is defined on a finite set of features F and a type hierarchy 〈T , ⊑〉. It is a tuple 〈Q, r, δ, θ〉, where: ◮ Q is a finite set of nodes ◮ r ∈ Q (r is the root node) ◮ δ : Q × F ↦→ Q is a partial feature value function ◮ θ : Q ↦→ T is a partial typing function subject to the following conditions: 1. r isn’t a δ-descendant. 2. all members of Q except r are δ-descendants of r. (*) there is no node n or path π such that δ(n, π) = n. Weiwei Sun Head-driven Phrase Structure Grammar I 26/61
- Page 1 and 2: Head-driven Phrase Structure Gramma
- Page 3 and 4: Basic Idea Typed feature structure
- Page 5 and 6: Basic Idea Typed feature structure
- Page 7 and 8: Basic Idea Typed feature structure
- Page 9 and 10: Basic Idea Typed feature structure
- Page 11 and 12: Basic Idea Typed feature structure
- Page 13 and 14: Basic Idea Typed feature structure
- Page 15 and 16: Basic Idea Typed feature structure
- Page 17 and 18: Basic Idea Typed feature structure
- Page 19 and 20: Basic Idea Typed feature structure
- Page 21 and 22: Basic Idea Typed feature structure
- Page 23 and 24: Basic Idea Typed feature structure
- Page 25 and 26: Basic Idea Typed feature structure
- Page 27: Basic Idea Typed feature structure
- Page 31 and 32: Basic Idea Typed feature structure
- Page 33 and 34: Basic Idea Typed feature structure
- Page 35 and 36: Basic Idea Typed feature structure
- Page 37 and 38: Basic Idea Typed feature structure
- Page 39 and 40: Basic Idea Typed feature structure
- Page 41 and 42: Basic Idea Typed feature structure
- Page 43 and 44: Basic Idea Typed feature structure
- Page 45 and 46: Basic Idea Typed feature structure
- Page 47 and 48: Basic Idea Typed feature structure
- Page 49 and 50: Basic Idea Typed feature structure
- Page 51 and 52: Basic Idea Typed feature structure
- Page 53 and 54: Basic Idea Typed feature structure
- Page 55 and 56: Basic Idea Typed feature structure
- Page 57 and 58: Basic Idea Typed feature structure
- Page 59 and 60: Basic Idea Typed feature structure
- Page 61 and 62: Basic Idea Typed feature structure
- Page 63 and 64: Basic Idea Typed feature structure
- Page 65 and 66: Basic Idea Typed feature structure
- Page 67 and 68: Basic Idea Typed feature structure
- Page 69 and 70: Basic Idea Typed feature structure
- Page 71 and 72: Basic Idea Typed feature structure
- Page 73: Basic Idea Typed feature structure
Basic Idea Typed feature structure HPSG: First glance<br />
TFS: Formal definition<br />
Definition<br />
A typed feature structure is defined on a finite set of features F<br />
and a type hierarchy 〈T , ⊑〉. It is a tuple 〈Q, r, δ, θ〉, where:<br />
◮ Q is a finite set of nodes<br />
◮ r ∈ Q (r is the root node)<br />
◮ δ : Q × F ↦→ Q is a partial feature value function<br />
◮ θ : Q ↦→ T is a partial typing function<br />
subject to the following conditions:<br />
1. r isn’t a δ-descendant.<br />
2. all members of Q except r are δ-descendants of r.<br />
(*) there is no node n or path π such that δ(n, π) = n.<br />
Weiwei Sun <strong>Head</strong>-<strong>driven</strong> <strong>Phrase</strong> <strong>Structure</strong> <strong>Grammar</strong> I 26/61