Featured Linguist!

Jost Gippert: Our Featured Linguist!

"Buenos dias", "buenas noches" -- this was the first words in a foreign language I heard in my life, as a three-year old boy growing up in developing post-war Western Germany, where the first gastarbeiters had arrived from Spain. Fascinated by the strange sounds, I tried to get to know some more languages, the only opportunity being TV courses of English and French -- there was no foreign language education for pre-teen school children in Germany yet in those days. Read more



Donate Now | Visit the Fund Drive Homepage

Amount Raised:

$34413

Still Needed:

$40587

Can anyone overtake Syntax in the Subfield Challenge ?

Grad School Challenge Leader: University of Washington


Publishing Partner: Cambridge University Press CUP Extra Publisher Login

Discussion Details




Title: Finite State Automata & Context-sensitive Language
Submitter: Jiun-Shiung Wu
Description: It has been widely-known that context-sensitive language cannot be modeled
by finite state automata. However, phonological rules, which are
context-sensitive, can be modeled by finite state automata, as discussed in
Daniel Jurafsky's introductory book on computational linguistics. Can
anyone explain the discrepancy here? Thank you!
Date Posted: 02-Jul-2007
Linguistic Field(s): Computational Linguistics
LL Issue: 18.1982
Posted: 02-Jul-2007

Search Again

Back to Discussions Index