Submit Search
Upload
Chart parsing with features
•
1 like
•
64 views
S
SRah Sanei
Follow
Visualized by Sarah Saneei
Read less
Read more
Education
Report
Share
Report
Share
1 of 64
Download now
Download to read offline
Recommended
Tests unitaires pour PostgreSQL avec pgTap
Tests unitaires pour PostgreSQL avec pgTap
Rodolphe Quiédeville
Lec23
Lec23
Nikhil Chilwant
Lec24
Lec24
Nikhil Chilwant
Modern technologies in data science
Modern technologies in data science
Chucheng Hsieh
Interfaz Grafica En Java
Interfaz Grafica En Java
Řỉgö VẻGầ
Bw-Tree Update Implementation
Bw-Tree Update Implementation
DaeIn Lee
Data structures cs301 power point slides lecture 03
Data structures cs301 power point slides lecture 03
Nasir Mehmood
merged_document_3
merged_document_3
tori hoff
Recommended
Tests unitaires pour PostgreSQL avec pgTap
Tests unitaires pour PostgreSQL avec pgTap
Rodolphe Quiédeville
Lec23
Lec23
Nikhil Chilwant
Lec24
Lec24
Nikhil Chilwant
Modern technologies in data science
Modern technologies in data science
Chucheng Hsieh
Interfaz Grafica En Java
Interfaz Grafica En Java
Řỉgö VẻGầ
Bw-Tree Update Implementation
Bw-Tree Update Implementation
DaeIn Lee
Data structures cs301 power point slides lecture 03
Data structures cs301 power point slides lecture 03
Nasir Mehmood
merged_document_3
merged_document_3
tori hoff
Clips basics how to make expert system in clips | facts adding | rules makin...
Clips basics how to make expert system in clips | facts adding | rules makin...
NaumanMalik30
Evolving with Java - How to remain Relevant and Effective
Evolving with Java - How to remain Relevant and Effective
Naresha K
The Ring programming language version 1.9 book - Part 33 of 210
The Ring programming language version 1.9 book - Part 33 of 210
Mahmoud Samir Fayed
Java Beagle
Java Beagle
adil raja
With package
With package
hyotang666
computer notes - Data Structures - 3
computer notes - Data Structures - 3
ecomputernotes
Grammatical Optimization
Grammatical Optimization
adil raja
Introduction to ATS plugins
Introduction to ATS plugins
PSUdaemon
Advanced SQL Queries
Advanced SQL Queries
Stefan Vartolomeev
Transducers in JavaScript
Transducers in JavaScript
Pavel Forkert
DSU C&C++ Practical File Diploma
DSU C&C++ Practical File Diploma
mustkeem khan
The Ring programming language version 1.5.4 book - Part 26 of 185
The Ring programming language version 1.5.4 book - Part 26 of 185
Mahmoud Samir Fayed
FrontDays #3. Иван Федяев, Эволюция JavaScript. Обзор нововведений ECMAScript 6
FrontDays #3. Иван Федяев, Эволюция JavaScript. Обзор нововведений ECMAScript 6
FrontDays
Eta
Eta
Jarek Ratajski
Python for Scientific Computing -- Ricardo Cruz
Python for Scientific Computing -- Ricardo Cruz
rpmcruz
reshape.pdf
reshape.pdf
Jose Miguel Alves
Simpatía
Simpatía
eliacosta2010
Beauty and the beast - Haskell on JVM
Beauty and the beast - Haskell on JVM
Jarek Ratajski
Load-time Hacking using LD_PRELOAD
Load-time Hacking using LD_PRELOAD
Dharmalingam Ganesan
Gan
Gan
Edaphon
Compiling openCypher graph queries with Spark Catalyst
Compiling openCypher graph queries with Spark Catalyst
Gábor Szárnyas
Spark_Documentation_Template1
Spark_Documentation_Template1
Nagavarunkumar Kolla
More Related Content
What's hot
Clips basics how to make expert system in clips | facts adding | rules makin...
Clips basics how to make expert system in clips | facts adding | rules makin...
NaumanMalik30
Evolving with Java - How to remain Relevant and Effective
Evolving with Java - How to remain Relevant and Effective
Naresha K
The Ring programming language version 1.9 book - Part 33 of 210
The Ring programming language version 1.9 book - Part 33 of 210
Mahmoud Samir Fayed
Java Beagle
Java Beagle
adil raja
With package
With package
hyotang666
computer notes - Data Structures - 3
computer notes - Data Structures - 3
ecomputernotes
Grammatical Optimization
Grammatical Optimization
adil raja
Introduction to ATS plugins
Introduction to ATS plugins
PSUdaemon
Advanced SQL Queries
Advanced SQL Queries
Stefan Vartolomeev
Transducers in JavaScript
Transducers in JavaScript
Pavel Forkert
DSU C&C++ Practical File Diploma
DSU C&C++ Practical File Diploma
mustkeem khan
The Ring programming language version 1.5.4 book - Part 26 of 185
The Ring programming language version 1.5.4 book - Part 26 of 185
Mahmoud Samir Fayed
FrontDays #3. Иван Федяев, Эволюция JavaScript. Обзор нововведений ECMAScript 6
FrontDays #3. Иван Федяев, Эволюция JavaScript. Обзор нововведений ECMAScript 6
FrontDays
Eta
Eta
Jarek Ratajski
What's hot
(14)
Clips basics how to make expert system in clips | facts adding | rules makin...
Clips basics how to make expert system in clips | facts adding | rules makin...
Evolving with Java - How to remain Relevant and Effective
Evolving with Java - How to remain Relevant and Effective
The Ring programming language version 1.9 book - Part 33 of 210
The Ring programming language version 1.9 book - Part 33 of 210
Java Beagle
Java Beagle
With package
With package
computer notes - Data Structures - 3
computer notes - Data Structures - 3
Grammatical Optimization
Grammatical Optimization
Introduction to ATS plugins
Introduction to ATS plugins
Advanced SQL Queries
Advanced SQL Queries
Transducers in JavaScript
Transducers in JavaScript
DSU C&C++ Practical File Diploma
DSU C&C++ Practical File Diploma
The Ring programming language version 1.5.4 book - Part 26 of 185
The Ring programming language version 1.5.4 book - Part 26 of 185
FrontDays #3. Иван Федяев, Эволюция JavaScript. Обзор нововведений ECMAScript 6
FrontDays #3. Иван Федяев, Эволюция JavaScript. Обзор нововведений ECMAScript 6
Eta
Eta
Similar to Chart parsing with features
Python for Scientific Computing -- Ricardo Cruz
Python for Scientific Computing -- Ricardo Cruz
rpmcruz
reshape.pdf
reshape.pdf
Jose Miguel Alves
Simpatía
Simpatía
eliacosta2010
Beauty and the beast - Haskell on JVM
Beauty and the beast - Haskell on JVM
Jarek Ratajski
Load-time Hacking using LD_PRELOAD
Load-time Hacking using LD_PRELOAD
Dharmalingam Ganesan
Gan
Gan
Edaphon
Compiling openCypher graph queries with Spark Catalyst
Compiling openCypher graph queries with Spark Catalyst
Gábor Szárnyas
Spark_Documentation_Template1
Spark_Documentation_Template1
Nagavarunkumar Kolla
Lisp and prolog in artificial intelligence
Lisp and prolog in artificial intelligence
ArtiSolanki5
Compilation of COSMO for GPU using LLVM
Compilation of COSMO for GPU using LLVM
Linaro
TensorFlow 2: New Era of Developing Deep Learning Models
TensorFlow 2: New Era of Developing Deep Learning Models
Jeongkyu Shin
Mergesort
Mergesort
luzenith_g
Introduction to Assembly Language
Introduction to Assembly Language
Motaz Saad
Music as data
Music as data
John Vlachoyiannis
Annals of Statistics読み回 第一回
Annals of Statistics読み回 第一回
jkomiyama
Software to the slaughter
Software to the slaughter
Quinn Wilton
#PDR15 - Developing for Round
#PDR15 - Developing for Round
Pebble Technology
Ankita sharma focp
Ankita sharma focp
AnkitaSharma463389
2014-06-20 Multinomial Logistic Regression with Apache Spark
2014-06-20 Multinomial Logistic Regression with Apache Spark
DB Tsai
Parallel Computing in R
Parallel Computing in R
mickey24
Similar to Chart parsing with features
(20)
Python for Scientific Computing -- Ricardo Cruz
Python for Scientific Computing -- Ricardo Cruz
reshape.pdf
reshape.pdf
Simpatía
Simpatía
Beauty and the beast - Haskell on JVM
Beauty and the beast - Haskell on JVM
Load-time Hacking using LD_PRELOAD
Load-time Hacking using LD_PRELOAD
Gan
Gan
Compiling openCypher graph queries with Spark Catalyst
Compiling openCypher graph queries with Spark Catalyst
Spark_Documentation_Template1
Spark_Documentation_Template1
Lisp and prolog in artificial intelligence
Lisp and prolog in artificial intelligence
Compilation of COSMO for GPU using LLVM
Compilation of COSMO for GPU using LLVM
TensorFlow 2: New Era of Developing Deep Learning Models
TensorFlow 2: New Era of Developing Deep Learning Models
Mergesort
Mergesort
Introduction to Assembly Language
Introduction to Assembly Language
Music as data
Music as data
Annals of Statistics読み回 第一回
Annals of Statistics読み回 第一回
Software to the slaughter
Software to the slaughter
#PDR15 - Developing for Round
#PDR15 - Developing for Round
Ankita sharma focp
Ankita sharma focp
2014-06-20 Multinomial Logistic Regression with Apache Spark
2014-06-20 Multinomial Logistic Regression with Apache Spark
Parallel Computing in R
Parallel Computing in R
More from SRah Sanei
Forward algorithm step by step
Forward algorithm step by step
SRah Sanei
Story generation-Sarah Saneei
Story generation-Sarah Saneei
SRah Sanei
Morphological rules- Sarah Saneei
Morphological rules- Sarah Saneei
SRah Sanei
Basic concepts-Sarah Saneei
Basic concepts-Sarah Saneei
SRah Sanei
Viterbi-Sarah Saneei
Viterbi-Sarah Saneei
SRah Sanei
Chart parsing- Sarah Saneei
Chart parsing- Sarah Saneei
SRah Sanei
More from SRah Sanei
(6)
Forward algorithm step by step
Forward algorithm step by step
Story generation-Sarah Saneei
Story generation-Sarah Saneei
Morphological rules- Sarah Saneei
Morphological rules- Sarah Saneei
Basic concepts-Sarah Saneei
Basic concepts-Sarah Saneei
Viterbi-Sarah Saneei
Viterbi-Sarah Saneei
Chart parsing- Sarah Saneei
Chart parsing- Sarah Saneei
Recently uploaded
Hierarchy of management that covers different levels of management
Hierarchy of management that covers different levels of management
mkooblal
Historical philosophical, theoretical, and legal foundations of special and i...
Historical philosophical, theoretical, and legal foundations of special and i...
jaredbarbolino94
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptx
thorishapillay1
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
VS Mahajan Coaching Centre
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
eniolaolutunde
MARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized Group
JonathanParaisoCruz
internship ppt on smartinternz platform as salesforce developer
internship ppt on smartinternz platform as salesforce developer
unnathinaik
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953056974 Low Rate Call Girls In Saket, Delhi NCR
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptx
GaneshChakor2
Painted Grey Ware.pptx, PGW Culture of India
Painted Grey Ware.pptx, PGW Culture of India
Virag Sontakke
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
NirmalaLoungPoorunde1
KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...
KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...
M56BOOKSTORE PRODUCT/SERVICE
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
UjwalaBharambe
EPANDING THE CONTENT OF AN OUTLINE using notes.pptx
EPANDING THE CONTENT OF AN OUTLINE using notes.pptx
RaymartEstabillo3
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptx
manuelaromero2013
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Sumit Tiwari
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
Sayali Powar
Pharmacognosy Flower 3. Compositae 2023.pdf
Pharmacognosy Flower 3. Compositae 2023.pdf
Mahmoud M. Sallam
Capitol Tech U Doctoral Presentation - April 2024.pptx
Capitol Tech U Doctoral Presentation - April 2024.pptx
CapitolTechU
Meghan Sutherland In Media Res Media Component
Meghan Sutherland In Media Res Media Component
InMediaRes1
Recently uploaded
(20)
Hierarchy of management that covers different levels of management
Hierarchy of management that covers different levels of management
Historical philosophical, theoretical, and legal foundations of special and i...
Historical philosophical, theoretical, and legal foundations of special and i...
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
MARGINALIZATION (Different learners in Marginalized Group
MARGINALIZATION (Different learners in Marginalized Group
internship ppt on smartinternz platform as salesforce developer
internship ppt on smartinternz platform as salesforce developer
9953330565 Low Rate Call Girls In Rohini Delhi NCR
9953330565 Low Rate Call Girls In Rohini Delhi NCR
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptx
Painted Grey Ware.pptx, PGW Culture of India
Painted Grey Ware.pptx, PGW Culture of India
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...
KSHARA STURA .pptx---KSHARA KARMA THERAPY (CAUSTIC THERAPY)————IMP.OF KSHARA ...
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
EPANDING THE CONTENT OF AN OUTLINE using notes.pptx
EPANDING THE CONTENT OF AN OUTLINE using notes.pptx
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptx
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
POINT- BIOCHEMISTRY SEM 2 ENZYMES UNIT 5.pptx
Pharmacognosy Flower 3. Compositae 2023.pdf
Pharmacognosy Flower 3. Compositae 2023.pdf
Capitol Tech U Doctoral Presentation - April 2024.pptx
Capitol Tech U Doctoral Presentation - April 2024.pptx
Meghan Sutherland In Media Res Media Component
Meghan Sutherland In Media Res Media Component
Chart parsing with features
1.
Chart Parsing using features Sarah
Saneei Computational Linguistics
2.
کار کلی مراحل است
خالی آجاندا.کنیممی آن وارد را بعدی یکلمه دستوری هایمقوله. چهارم مرحله: کارنت منتظر که دارد وجود فعالی کمان آیا(اینجا درX)باشد؟ 1/از قبل اشنقطهXباشد.2/ابتدایXباشد آن انتهای. سوم مرحله: دهیممی قرار چارت در را ایمخوانده که کارنتی. دوم مرحله: دهیممی تشکیل فعال کمان کارنت با.شوندمی فعال کمان به تبدیل شوندمی شروع کارنت با که هاییقاعده آن. اول مرحله: ریزیم می کارنت در و خوانیم می آجاندا از
3.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 𝑷 𝟏 C 𝑷 𝟐 کنیممی وارد آجاندا در را اشنحوی هایمقوله و خوانیممی را اول یکلمه ابتدا. 1 2 3 4 5 6
4.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 اول مرحله: ریزیم می کارنت در و خوانیم می آجاندا از. 1 2 3 4 5 6
5.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 دوم مرحله: دهیممی تشکیل فعال کمان کارنت با.شروع کارنت با که هاییقاعده آن شوندمی فعال کمان به تبدیل شوندمی. 1 2 3 4 5 6 NP {3s} → PRO{3s}●
6.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 سوم مرحله: دهیممی قرار چارت در را ایمخوانده که کارنتی. 1 2 3 4 5 6 NP {3s} → PRO{3s}● PRO1 CAT PRO AGR 3s
7.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 چهارم مرحله: باشد؟ کارنت منتظر که دارد وجود فعالی کمان آیا (خیر) 1 2 3 4 5 6 NP {3s} → PRO{3s}● PRO1 CAT PRO AGR 3s
8.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 چیزی منتظر دیگر قاعده آن یعنی رسدمی قاعده یک آخر به نقطه وقتینیست کمان وPassiveاست شده.کلNPبریممی آجاندا داخل به را(یکNP ایمدیده). 1 2 3 4 5 6 NP {3s} → PRO{3s}● PRO1 CAT PRO AGR 3s
9.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 اول مرحله: ریزیم می کارنت در و خوانیم می آجاندا از 1 2 3 4 5 6 NP {3s} → PRO{3s}● PRO1 CAT PRO AGR 3s
10.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 دوم مرحله: دهیممی تشکیل فعال کمان کارنت با.شروع کارنت با که هاییقاعده آن شوندمی مقداردهی متغیرهایشان و فعال کمان به تبدیل شوندمی. 1 2 3 4 5 6 NP {3s} → PRO{3s}● PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s)
11.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 سوم مرحله: دهیممی قرار چارت در را ایمخوانده که کارنتی. 1 2 3 4 5 6 NP {3s} → PRO{3s}● PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s
12.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 چهارم مرحله: باشد؟ کارنت منتظر که دارد وجود فعالی کمان آیا (خیر) 1 2 3 4 5 6 NP {3s} → PRO{3s}● PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s
13.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 در را اشنحوی هایمقوله و خوانیممی را بعدی یکلمه ،است خالی آجاندا چون کنیممی وارد آجاندا. 1 2 3 4 5 6 NP {3s} → PRO{3s}● PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s
14.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 اول مرحله: ریزیم می کارنت در و خوانیم می آجاندا از 1 2 3 4 5 6 NP {3s} → PRO{3s}● PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s
15.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6.VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 دوم مرحله: دهیممی تشکیل فعال کمان کارنت با.شروع کارنت با که هاییقاعده آن شوندمی فعال کمان به تبدیل شوندمی.Ruleکه هاییSUBCATکارنت خاص دارند راFireشوندمی. 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s
16.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 دوم مرحله: دهیممی تشکیل فعال کمان کارنت با.شروع کارنت با که هاییقاعده آن شوندمی فعال کمان به تبدیل شوندمی.Ruleکه هاییSUBCATکارنت خاص دارند راFireشوندمی. 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf]
17.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 سوم مرحله: دهیممی قرار چارت در را ایمخوانده که کارنتی. 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf]
18.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] چهارم مرحله: باشد؟ کارنت منتظر که دارد وجود فعالی کمان آیا (خیر)
19.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] در را اشنحوی هایمقوله و خوانیممی را بعدی یکلمه ،است خالی آجاندا چون کنیممی وارد آجاندا.
20.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] اول مرحله: ریزیم می کارنت در و خوانیم می آجاندا از
21.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] دوم مرحله: دهیممی تشکیل فعال کمان کارنت با.شروع کارنت با که هاییقاعده آن شوندمی فعال کمان به تبدیل شوندمی.
22.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] دوم مرحله: دهیممی تشکیل فعال کمان کارنت با.شروع کارنت با که هاییقاعده آن شوندمی فعال کمان به تبدیل شوندمی. VP[inf] → TO ● VP[base]
23.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] سوم مرحله: دهیممی قرار چارت در را ایمخوانده که کارنتی. TO1 CAT TO
24.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO چهارم مرحله: باشد؟ کارنت منتظر که دارد وجود فعالی کمان آیا (خیر)
25.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 4 V[base, _adjp, _np] 5 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO و بعدی یکلمه اشنحوی هایمقوله
26.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_vp:np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 4 V[base, _adjp, _np] 5 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 4 V[base, _adjp, _np] 5 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_vp:np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO اول مرحله
27.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 4 V[base, _adjp, _np] 5 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 4 V[base, _adjp, _np] 5 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO دوم مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP
28.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 4 V[base, _adjp, _np] 5 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 4 V[base, _adjp, _np] 5 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO سوم مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np]
29.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 4 V[base, _adjp, _np] 5 𝑷 𝟏 C 𝑷 𝟐 1 PRO{3s} 2 1 NP{3s} 2 2 V[pres, 3s, _np,_vp:inf, _np_vp:inf] 3 3 TO 4 4 V[base, _adjp, _np] 5 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO چهارم مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np]
30.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] 𝑷 𝟏 Ag. 𝑷 𝟐𝑷 𝟏 C 𝑷 𝟐
31.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO است خالی آجاندا VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐
32.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO اول مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np]
33.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO دوم مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] ADJP→ ADJ ●
34.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO سوم مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] ADJP[_vp:inf]→ ADJ [_vp:inf] ● ADJ1 CAT ADJ [_vp:inf]
35.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO چهارم مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] ADJP[_vp:inf] → ADJ[_vp:inf] ● ADJ1 CAT ADJ [_vp:inf]
36.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO کمان آخر نقطه VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] ADJP[_vp:inf] → ADJ[_vp:inf] ● ADJ1 CAT ADJ [_vp:inf]
37.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO اول مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf]
38.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO دوم مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf]
39.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO سوم مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf]
40.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO چهارم مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf]
41.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO چهارم مرحله VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP[base] → V[base, _adjp, _np] ADJP●
42.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO کمان آخر نقطه VP[base]→ V[base, _adjp, _np] ● NP VP[base] → V[base, _adjp, _np] ● ADJP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP[base] → V[base, _adjp, _np] ADJP●
43.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO اول مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf]
44.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO دوم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf]
45.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO سوم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base]
46.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO چهارم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base]
47.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] VP[inf] → TO ● VP[base] TO1 CAT TO چهارم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP[inf] → TO VP[base] ●
48.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO کمان آخر نقطه VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP[inf] → TO VP[base] ●
49.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO اول مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base]
50.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO دوم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base]
51.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO سوم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf]
52.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO چهارم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf]
53.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V[pres,3s _vp:inf] ● VP[inf] VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO چهارم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf] VP → V[pres,3s _vp:inf] VP[inf] ●
54.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO کمان آخر نقطه VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf] VP → V[pres,3s _vp:inf] VP[inf]●
55.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO اول مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf]
56.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO دوم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf]
57.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO سوم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf] VP3 CAT VP [pres,3s,_vp:inf]
58.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO چهارم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf] VP3 CAT VP [pres,3s,_vp:inf]
59.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s S → (NP AGR 3s) ● (VP AGR 3s) NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO چهارم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf] VP3 CAT VP [pres,3s,_vp:inf] S → (NP AGR 3s) (VP AGR 3s) ●
60.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 S 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO کمان آخر نقطه VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf] VP3 CAT VP [pres,3s,_vp:inf] S → (NP AGR 3s) (VP AGR 3s) ●
61.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 S 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 S 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO اول مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf] VP3 CAT VP [pres,3s,_vp:inf]
62.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 S 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 S 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO دوم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf] VP3 CAT VP [pres,3s,_vp:inf]
63.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 S 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 S 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s NP1 CAT NP AGR 3s VP→ V[pres,3s,_np] ● NP VP → V [pres,3s,_np_vp:inf] ● NP VP[inf] V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO سوم مرحله VP[base]→ V[base, _adjp, _np] ● NP V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf] VP3 CAT VP [pres,3s,_vp:inf] S CAT S [pres,3s,_vp:inf]
64.
Chart:CompletedarcsChart:Activearcs GrammarAgenda He wants to
be happy. 1. S → (NP AGR ?a) (VP [{pres,past}] AGR ?a) 2.NP → (ART AGR ?a) (N AGR ?a) 3.NP → PRO 9.VP[inf] →TO VP[base] 4.VP → V[_none] 10. ADJP →ADJ 5. VP→ V[_np] NP 6. VP → V[_vp:inf] VP[inf] 7. VP → V[_np_vp:inf] NP VP[inf] 8.VP→V[_adjp] ADJP Lexicon he : (CAT PRO AGR 3s) want : (V VFORM base SUBCAT {_np,_vp:inf, _np_vp:inf}) to : (CAT TO) be : (CAT V VFORM base SUBCAT {_adjp, _np}) happy : (CAT ADJ SUBCAT _vp:inf) 1 2 3 4 5 6 Current 𝑷 𝟏 Ag. 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 S 6 𝑷 𝟏 C 𝑷 𝟐 5 ADJ[_vp:inf] 6 5 ADJP[_vp:inf] 6 4 VP[base] 6 3 VP[inf] 6 2 VP[pres,3s,_vp:inf] 6 1 S 6 1 2 3 4 5 6 PRO1 CAT PRO AGR 3s NP1 CAT NP AGR 3s V1 CAT V AGR 3s [_np_vp:inf,_np, _vp:inf] TO1 CAT TO V2 CAT V VFORM base [_adjp, _np] ADJ1 CAT ADJ [_vp:inf] ADJP1 CAT ADJP [_vp:inf] VP1 CAT VP [base] VP2 CAT VP [inf] VP3 CAT VP [pres,3s,_vp:inf] S CAT S [pres,3s,_vp:inf]
Download now