Function 4: Spell Correction _spellCorrection( string1, string2 ) Create a JavaScript function expression that meets the following requirements: Authored using funetion expression syntax (constant name _spellCorrection) Receives two strings, the first argument is a correct string, the second argument is an incorrect string. • The first argument, the correct string, represents what is supposed to be typed • The second argument, the incorrect string, represents what was provided • The function returns an array of all keys that were missed (what were supposed to be provided) o The returned array should be ordered by when they first appear in the sentence Only one broken key per letter should be listed (see example 6) If second argument, is greater in length than the first argument, the function simply returns "invalid" in the returned array (see example 5). • The first argument could be greater in length than the second (see example 2, example 3) • Console log output is NOT permitted. • The function should pass each of the illustrated examples below at a minimum. _spellCorrection ("GBC", "GBC") → [""] _spellCorrection ("GBC", "GB“) → ["C"] _spellCorrection("GBC", "GC") → ["B", "C"] _spellCorrection ("GB C", "GC") → ["B", " ", "C"] _spellCorrection ("GB", "GBC") → ["invalid"] _spellCorrection ("happy birthday", "hawwy birthday") → ["p"] spellCorrection ("starry night", "starrq light") → ["y", "n"]
Function 4: Spell Correction _spellCorrection( string1, string2 ) Create a JavaScript function expression that meets the following requirements: Authored using funetion expression syntax (constant name _spellCorrection) Receives two strings, the first argument is a correct string, the second argument is an incorrect string. • The first argument, the correct string, represents what is supposed to be typed • The second argument, the incorrect string, represents what was provided • The function returns an array of all keys that were missed (what were supposed to be provided) o The returned array should be ordered by when they first appear in the sentence Only one broken key per letter should be listed (see example 6) If second argument, is greater in length than the first argument, the function simply returns "invalid" in the returned array (see example 5). • The first argument could be greater in length than the second (see example 2, example 3) • Console log output is NOT permitted. • The function should pass each of the illustrated examples below at a minimum. _spellCorrection ("GBC", "GBC") → [""] _spellCorrection ("GBC", "GB“) → ["C"] _spellCorrection("GBC", "GC") → ["B", "C"] _spellCorrection ("GB C", "GC") → ["B", " ", "C"] _spellCorrection ("GB", "GBC") → ["invalid"] _spellCorrection ("happy birthday", "hawwy birthday") → ["p"] spellCorrection ("starry night", "starrq light") → ["y", "n"]
C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter6: Modularity Using Functions
Section6.1: Function And Parameter Declarations
Problem 13E
Related questions
Question
![Function 4: Spell Correction
_spellCorrection ( stringl, string2 )
Create a JavaScript function expression that meets the following requirements:
Authored using function expression syntax (constant name _spellCorrection)
• Receives two strings, the first argument is a correct string, the second argument is an incorrect string.
• The first argument, the correct string, represents what is supposed to be typed
• The second argument, the incorrect string, represents what was provided
The function returns an array of all keys that were missed (what were supposed to be provided)
o The returned array should be ordered by when they first appear in the sentence
Only one broken key per letter should be listed (see example 6)
If second argument, is greater in length than the first argument, the function simply returns "invalid" in the
returned array (see example 5).
• The first argument could be greater in length than the second (see example 2, example 3)
• Console log output is NOT permitted.
The function should pass each of the illustrated examples below at a minimum.
spellCorrection ("GBC", "GBC") → [""]
spellCorrection ("GBC", "GB") → ["c"]
spellCorrection ("GBC", "GC") → ["B", "C"]
spellCorrection ("GB C", "GC") → ["B",
, "C"]
spellCorrection ("GB", "GBC") → ["invalid"]
spellCorrection ("happy birthday", "hawwy birthday") → ["p"]
spellCorrection ("starry night", "starrg light") → ["y", "n"]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F46f2096e-c47f-42ea-b023-e5732a32d2c5%2F7223213c-1ab4-4945-aafa-821ffb1c9d23%2Fvn2klbl_processed.png&w=3840&q=75)
Transcribed Image Text:Function 4: Spell Correction
_spellCorrection ( stringl, string2 )
Create a JavaScript function expression that meets the following requirements:
Authored using function expression syntax (constant name _spellCorrection)
• Receives two strings, the first argument is a correct string, the second argument is an incorrect string.
• The first argument, the correct string, represents what is supposed to be typed
• The second argument, the incorrect string, represents what was provided
The function returns an array of all keys that were missed (what were supposed to be provided)
o The returned array should be ordered by when they first appear in the sentence
Only one broken key per letter should be listed (see example 6)
If second argument, is greater in length than the first argument, the function simply returns "invalid" in the
returned array (see example 5).
• The first argument could be greater in length than the second (see example 2, example 3)
• Console log output is NOT permitted.
The function should pass each of the illustrated examples below at a minimum.
spellCorrection ("GBC", "GBC") → [""]
spellCorrection ("GBC", "GB") → ["c"]
spellCorrection ("GBC", "GC") → ["B", "C"]
spellCorrection ("GB C", "GC") → ["B",
, "C"]
spellCorrection ("GB", "GBC") → ["invalid"]
spellCorrection ("happy birthday", "hawwy birthday") → ["p"]
spellCorrection ("starry night", "starrg light") → ["y", "n"]
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr