computer science

Match rating approach

Match rating approach is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Match rating approach rather than just read about it. In short: The match rating approach (MRA) is a phonetic algorithm for indexing of words by their pronunciation developed by Western Airlines in 1977 for the indexation and comparison of homophonous names. The algorithm itself has a simple set of encoding rules but a more lengthy set of comparison rules.

Key takeaways

Match rating approach belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Match rating approach to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Match rating approach from memory before moving on to harder problems.

Reference excerpt

The match rating approach (MRA) is a phonetic algorithm for indexing of words by their pronunciation developed by Western Airlines in 1977 for the indexation and comparison of homophonous names. The algorithm itself has a simple set of encoding rules but a more lengthy set of comparison rules. The main mechanism is the similarity comparison, which calculates the number of unmatched characters by comparing the strings from left to right and then from right to left, and removing identical characters. This value is subtracted from 6 and then compared to a minimum threshold. The minimum threshold is defined in table A and is dependent upon the length of the strings. The encoded name is known (perhaps incorrectly) as a personal numeric identifier (PNI). The encoded name can never contain more than 6 alpha only characters. The match rating approach performs well with names containing the letter "y", unlike the original flavor of the NYSIIS algorithm; for example, the surnames "Smith" and "Smyth" are successfully matched. However, MRA does not perform well with encoded names that differ in length by more than 2.

Encoding rules Delete all vowels unless the vowel begins the word Remove the second consonant of any double consonants present Reduce codex to 6 letters by joining the first 3 and last 3 letters only

Comparison rules In this section, the words "string(s)" and "name(s)" mean "encoded string(s)" and "encoded name(s)".

If the length difference between the encoded strings is 3 or greater, then no similarity comparison is done. Obtain the minimum rating value by calculating the length sum of the encoded strings and using table A. Process the encoded strings from left to right and remove any identical characters found from both strings respectively. Process the unmatched characters from right to left and remove any identical characters found from both names respectively. Subtract the number of unmatched characters from 6 in the longer string. This is the similarity rating. If the similarity rating is equal to or greater than the minimum rating, then the match is considered good.

Minimum threshold The following table shows the mapping between the minimum rating and the string lengths.

Match rating approach examples The table below displays the output of the match rating approach algorithm for some common homophonous names.

Worked examples

Example 1 — a first encounter with Match rating approach

Start with the simplest possible case. Write down what Match rating approach claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Match rating approach before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Match rating approach ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Match rating approach

In research: Match rating approach appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Match rating approach in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Match rating approach is common in secondary-school and first-year university syllabi. It links to neighbouring topics Phonetic algorithms, so understanding it makes those chapters shorter.
In everyday life: Look for Match rating approach outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Match rating approach” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Match rating approach in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Match rating approach means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Match rating approach out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Match rating approach in simple terms?

Why does Match rating approach matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Match rating approach?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Match rating approach.