MacEwan University
MacEwan University
Log in Sign up

Phonological computation

LING 473
Closed
Main contact
Concordia University
Concordia University
Montreal, Quebec, Canada
Charles Reiss
professor
1
Timeline
  • March 8, 2022
    Experience start
  • April 3, 2022
    Experience end
Experience
1 projects wanted
Dates set by experience
Preferred Community Partners
Anywhere
Large enterprise
Any industries

Experience scope

Categories
Data modelling
Skills
data analysis research problem analysis
Student goals and capabilities

Comparative assessment of different frameworks for the analysis of phonological patterns in natural language

Students

Students
Undergraduate
Any level
10 students
Project
20 hours per student
Students self-assign
Teams of 2
Expected outcomes and deliverables

Weighted finite-state transducers (WFSTs) are widely used by engineers and

computational linguists for generating and processing text and speech. Using the methods presented by Gorman and Sproat (Finite-State Text Processing, 2021) students will create case studies that include the compilation and application of context-dependent

rewrite rules, the construction of morphological analyzers and generators, and text

generation and processing applications. Kyle Gorman (CUNY/Google) will guest lecture in the course.

Project timeline
  • March 8, 2022
    Experience start
  • April 3, 2022
    Experience end

Project Examples

Requirements

Finite State Transducer implementations of the phonology of various natural languages

Additional Community Partner criteria

Community Partners must answer the following questions to submit a match request to this experience:

  • Q1 - Checkbox
  • Q2 - Checkbox