LINB04H3 Lecture Notes - Lecture 2: Asteroid Family, Vocal Tract, Sonorant

143 views10 pages

coffeeyellowjacket101

8 Apr 2015

School

Department

Course

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

We refer to p t k as a class easily. Instead of refereing to individuals we refere to them on commonalities. These assumptions are not shared by everyone but most agree on this. Some fetures are not important - say tention, vocal tract highness, etc. Distinctive features should pick out those aspescts that matter for phonology. Have to have enough distinctive features to ddistinguish all sounds, all constrastive properties of a language. There might be some disagreement on this one. W -> u wes on onset, occurs where consonants occur. To dinstigush glides from vowel we use +/- syllabic. Obstruents don"t have a class they are - sonorants. Instead of +/- syllabic refer to as c. v. Laterlas - might be classified as + continuent. There is no - labial its either there or not. Wide body tongue - dental and postalveolar - wide surface. Alveolar and retroflex uses tongue tip - apical.

Related Questions

COMP 2021Winter 2010 - Final Examination Pape 11 110 6 . The two classes low compile without me. What is displayed when the main() method of class Nightmareix is executed? Clearly indicate the program output in the appropriate space ca pe You may use the other lank space as a scratch pad to track the state of memesy as the program escoles, but the contents of this other space will not he graded The definition of the Pair claw public cla Pair private int left: private int right publie Pairintit T left- right - public void nix (Pair pl loft - P.left public string toitring) return "IL... lort R right "1" The definition of the NightmareMix class public class Nightmareix public static void mix Inta (int il, int 12) public static void mixArraywithint fint 11 a, int i, int v) 11 - V public static void mixArrayaor Int(int il al, intl a2) public static void mixMatrixWithint fint 11111121 - m int 11, int 12, int v public static void mixMatrix WithArray (int 11 11- , int i, intila) public static void mixlar Addresses Pair pl, Pair 2) pl - p2 public static void mixArrayWithPairState (Pair) a, int i, Pair pl public static void mixArrayWithPairAddress (Pairla, int i, Pair p) ali - P; public static void mixArrayaoraira (Pairil al, Pairil a2) public static void main(Stringil arga) int myV1 - 1; int myV2 - 2; int my = (3, 4) int my2 = 5, 6) into myM1 , 8 9, 10}} Pair myP1 = new Pair (11, 12) Pair myP2 = new Pair (13, 14) Pair myPA (neu Pair (15, 16), new pair(17, 18) Pair myPA2 = (neu Pair (19, 20), new pair (21, 22) mixInita (myvi, myV2); mixArrayWith Int (myal, 0, myv2); mixArraysOfIntinyal, myA2); MixMatrixWithint (myM, 0, 0, myV2); mixArrayaofTnt (HyMIO, myM[1); mixMatrixWithArray (wy, , WyA2); mixArraywithint nyA2, 0, myV2); mixPair Addresses (wypi, myP2); RixPairAddren (HyPALIO), WPAI[1]); mixArraywithPairstate (myPA2, 0, 1); mixArraywithPairAddresa (myPA2, 1, WP2); mixArray Paira (wyPal, myPAZ) System.out.println("1.. myvi) System.out.println("2: ( +WA110 A11] + " ") System.out.println("3: ( + myA2[0] + + m 2 (1) + " ); System.out.println("4: ( myM[0][0] + "," myM[0][1] + " myM[1][0] + " " + myM[1][1] + "} ") System.out.println('5: ( + myPA10) + myPA [1] + " "); System.out.println("6: ( myPA2[0 PA21] + " ); 1"

9. Finally, you should write a program MontrealMaps which will suggest a path to go along the metro to get from one place to another. The only required method for MontrealMaps is a main method but of course you are allowed to write others. Your program should do the following. For any library methods that you use, make sure that you are properly importing things and handling any exceptions they may throw. (10 points) • Using an appropriate library method, you should create a Subway System object. If this method fails to initialize, you should print the message Error, not enough funding. • Use a Scanner and print statements to read the current x and y position of the user. • Use a Scanner and print statements to read the x and y position that the user wants to go to. . Find the nearest Metro Station to both the start position of the user and his final destination. • If the 2 metro stations have the same name (i.e. are the same metro station) then print It is fastest to walk there. • Otherwise, call the method findPath from the previous part to find a path from these 2 metro stations. . If the method returns null, then print Sorry, there is no path on the metro, you'll have to walk • Otherwise, print the path using the metro using the method printPath defined in the MapUtilities class in the appendix. SUMMARY OF JAVA STANDARD LIBRARY METHODS POR SELECTED CLASSES • String package java.lang) Methods - public boolean gist and e rs is stingeancoject - puble boolean grease Sering another ca t ering String paint i th Stre C h eshilly before the Stripe with striert w Single weiter water N ENE fusha -publish tohy Casting de . File( p age java.io) Methods r eate - publie Yiling path : C • Scanner (package java.ut 1) Method -ple S ule - double Double Sc - le bon when : S Scanner tal de fethede h able othebean - puble String Best Mus eethe u s tepal -pulle haalean haxtLine: Check the hea ther in left PrintStream( p age java.io) Methods pul vaid pri Pribonaat - puli wid pride d oble vile. - pille vaid print Print vei. -pulle vaid printject o: Prints Object -puli vaid printString : Prints String .. - vaid primi The theme line by writing the li n e tie id print in bool bl. Prise n value the - public void platinabled Prints double ved and then the line - public void printit Prints Ent value and then tomis the - Pull vaid pri l l be t he minime publie wild prin t ing with String in the terminates the line • ArrayLiat package java.util) Methods - public boolean Arraybettype was a new ArrayList

1.Create a list that contains 10 successive integers starting with the value in the variable start. For example, if start is 7, the resulting list should be [7, 8, 9, 10, 11, 12, 13, 14, 15, 16]. Store the list in a variable named my_list. Assume that the value of start has already been set.

2.Create a list that is made up of the first half of the elements of a list called original_list. Store the new list in a variable called half_list. Assume that the original list has already been initialized and contains an even number of elements.

3. Write a predicate function called same_ends that accepts a list of integers and an integer (n) as arguments. Return True if the first n numbers in the list are the same as the last n numbers in the list, and False otherwise. For example, if the list was [1, 2, 3, 4, 99, 1, 2, 3, 4], the function would return True if n is 4 and False if n is 3. Assume that n is between 1 and the length of the list, inclusive.

4.Write a function called highest_values that accepts as arguments a list of numeric values and a single integer (n). The function should return a list made up of the largest n values from the argument list in order from lowest to highest. For example, if the argument list is [46, 82, 25, 61, 70, 33, 54] and n is 3, the return value should be [61, 70, 82]. Assume that the argument list contains at least n elements.

5.Assume that a list of integers stored in a variable named original contains exactly two elements that are zero. Write code that creates a separate list that contains the elements from original that are between the two zeros. Do not include the zeros in the new list. Store the list in a variable named between_zeros.

6. Write a function called price_range that accepts a list of floating-point numbers representing prices as an argument and returns the the difference between the highest price and the lowest price. Do NOT use the built-in functions max or min in your solution. Assume that all prices are positive values and that none of them exceed 10,000.00.

7. Write a function called count_vowels that accepts a string argument that represents a word and returns the number of vowels that are in the word. The vowels are A, E, I, O, and U (ignore the 'sometimes Y' rule). Count both uppercase and lowercase vowels.

Assume that the variable table holds a two-dimensional list of integers. Write code that computes the sum of all elements in the table, assigning the result to the variable table_sum.