Calculating distance

In the video exercise, you saw how to use Damerau-Levenshtein distance to identify how similar two strings are. As a reminder, Damerau-Levenshtein distance is the minimum number of steps needed to get from String A to String B, using these operations:

Insertion of a new character.
Deletion of an existing character.
Substitution of an existing character.
Transposition of two existing consecutive characters.

What is the Damerau-Levenshtein distance between the words "puffin" and "muffins" and which operation(s) gets you there?

แบบฝึกหัดนี้เป็นส่วนหนึ่งของหลักสูตร

Cleaning Data in R

ดูคอร์ส

แบบฝึกหัดเชิงโต้ตอบแบบลงมือทำจริง

เปลี่ยนทฤษฎีให้เป็นการลงมือทำด้วยแบบฝึกหัดเชิงโต้ตอบหนึ่งในของเรา

เริ่มแบบฝึกหัด

แบบฝึกหัดนี้เป็นส่วนหนึ่งของหลักสูตร

Cleaning Data in R

SkillTag.level.intermediateSkillTag.label

4.8+

เริ่มคอร์สฟรี

In this chapter, you'll learn how to overcome some of the most common dirty data problems. You'll convert data types, apply range constraints to remove future data points, and remove duplicated data points to avoid double-counting.

Exercise 1: Data type constraints Exercise 2: Common data types Exercise 3: Converting data types Exercise 4: Trimming strings Exercise 5: Range constraints Exercise 6: Ride duration constraints Exercise 7: Back to the future Exercise 8: Uniqueness constraints Exercise 9: Full duplicates Exercise 10: Removing partial duplicates Exercise 11: Aggregating partial duplicates

Categorical and text data can often be some of the messiest parts of a dataset due to their unstructured nature. In this chapter, you’ll learn how to fix whitespace and capitalization inconsistencies in category labels, collapse multiple categories into one, and reformat strings for consistency.

Exercise 1: Checking membership Exercise 2: Members only Exercise 3: Not a member Exercise 4: Categorical data problems Exercise 5: Identifying inconsistency Exercise 6: Correcting inconsistency Exercise 7: Collapsing categories Exercise 8: Cleaning text data Exercise 9: Detecting inconsistent text data Exercise 10: Replacing and removing Exercise 11: Invalid phone numbers

In this chapter, you’ll dive into more advanced data cleaning problems, such as ensuring that weights are all written in kilograms instead of pounds. You’ll also gain invaluable skills that will help you verify that values have been added correctly and that missing values don’t negatively impact your analyses.

Exercise 1: Uniformity Exercise 2: Date uniformity Exercise 3: Currency uniformity Exercise 4: Cross field validation Exercise 5: Validating totals Exercise 6: Validating age Exercise 7: Completeness Exercise 8: Types of missingness Exercise 9: Visualizing missing data Exercise 10: Treating missing data

Record linkage is a powerful technique used to merge multiple datasets together, used when values have typos or different spellings. In this chapter, you'll learn how to link records by calculating the similarity between strings—you’ll then use your new skills to join two restaurant review datasets into one clean master dataset.

Exercise 1: Comparing strings Exercise 2: Calculating distance

แบบฝึกหัดปัจจุบัน

Exercise 3: Small distance, small difference Exercise 4: Fixing typos with string distance Exercise 5: Generating and comparing pairs Exercise 6: Link or join?Exercise 7: Pair blocking Exercise 8: Comparing pairs Exercise 9: Scoring and linking Exercise 10: Score then select or select then score?Exercise 11: Putting it together Exercise 12: Congratulations!